University Examination Timetabling using Genetic Algorithm
نویسندگان
چکیده
The scheduling of examinations in universities or institutions is known to be a highly constrained combinatorial optimization problem. Generally it is done manually or with the limited help of a simple administration system and it usually involves, taking the previous year's timetable and modifying that so it will work for the next year. But now a days most of good universities provide much greater flexibility to students for selecting courses as well as greater choices. So it is no longer good enough to use the previous year's timetable. There should be some automatic timetabling system, which creates timetable every year. In this paper we have presented a prototype system of university examination timetabling with the help of Genetic Algorithm.
منابع مشابه
Generating Optimal Timetabling for Lecturers using Hybrid Fuzzy and Clustering Algorithms
UCTTP is a NP-hard problem, which must be performed for each semester frequently. The major technique in the presented approach would be analyzing data to resolve uncertainties of lecturers’ preferences and constraints within a department in order to obtain a ranking for each lecturer based on their requirements within a department where it is attempted to increase their satisfaction and develo...
متن کاملArtificial Immune Algorithms for University Timetabling
The university timetabling, examination and course, are known to be highly constrained optimization problems. Metaheuristic approaches, and their hybrids, have successfully been applied to solve the problems. This paper presents three artificial immune algorithms, the algorithms inspired by the immune system, for university timetabling; clonal selection, immune network and negative selection. T...
متن کاملA Standard Framework for Timetabling Problems
When timetabling experts are faced with a new timetabling problem, they usually develop a very specialised and optimised solution for this new underlying problem. One disadvantage of this strategy is that even slight changes of the problem description often cause a complete redesign of data structures and algorithms. Furthermore, other timetabling problems cannot be fit to the data structures p...
متن کاملA Hybrid Algorithm for the Examination Timetabling Problem
Examination timetabling is a well-studied combinatorial optimization problem. We present a new hybrid algorithm for examination timetabling, consisting of three phases: a constraint programming phase to develop an initial solution, a simulated annealing phase to improve the quality of solution, and a hill climbing phase for further improvement. The examination timetabling problem at the Univers...
متن کاملUsing fuzzy c-means clustering algorithm for common lecturer timetabling among departments
University course timetabling problem is one of the hard problems and it must be done for each term frequently which is an exhausting and time consuming task. The main technique in the presented approach is focused on developing and making the process of timetabling common lecturers among different departments of a university scalable. The aim of this paper is to improve the satisfaction of com...
متن کامل